منابع مشابه
Playing Muller Games in a Hurry
This work considers a finite-duration variant of Muller games, and their connection to infinite-duration Muller games. In particular, it studies the question of how long a finiteduration Muller game must be played before the winner of the finite-duration game is guaranteed to be able to win the corresponding infinite-duration game. Previous work by McNaughton has shown that this must occur afte...
متن کاملPlaying Pushdown Parity Games in a Hurry
Introduction. Infinite two-player games on graphs are a powerful tool to model, verify, and synthesize open reactive systems and are closely related to fixed-point logics. The winner of a play in such a game typically emerges only after completing the whole (infinite) play. Despite this, McNaughton became interested in playing infinite games in finite time, motivated by his belief that “infinit...
متن کاملPlaying Pushdown Parity Games in a Hurry ( Extended Abstract )
We continue the investigation of finite-duration variants of infinite-duration games by extending known results for games played on finite graphs to those played on infinite ones. In particular, we establish an equivalence between pushdown parity games and a finite-duration variant. This allows to determine the winner of a pushdown parity game by solving a reachability game on a finite tree.
متن کاملSolving Muller Games via Safety Games
We show how to transform a Muller game with n vertices into a safety game with (n!) vertices whose solution allows to determine the winning regions of the Muller game and a winning strategy for one player.
متن کاملComplexity Bounds for Muller Games
We consider the complexity of infinite games played on finite graphs. We establish a framework in which the expressiveness and succinctness of different types of winning conditions can be compared. We show that the problem of deciding the winner in Muller games is Pspace-complete. This is then used to establish Pspacecompleteness for Emerson-Lei games and for games described by Zielonka DAGs. A...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2012
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054112400321